Probability, Networks and Algorithms Some remarks on properties of generalized Pickands constants
نویسنده
چکیده
We study properties of generalized Pickands constants H that appear in the extreme value theory of Gaussian processes and are de ned via the limit H lim T H T T where H T IE exp maxt T p t Var t and t is a centered Gaussian process with stationary increments We give estimates of the rate of convergence of H T T to H and prove that if n t weakly converges in C to t then under some weak conditions limn H n H As an application we prove that HB is continuous on where B t is a fractional Brownian motion with Hurst parameter It contradicts the conjecture that is discontinuous at Mathematics Subject Classi cation G primary G M secondary
منابع مشابه
Generalized Pickands Constants
Pickands constants play an important role in the exact asymptotic of extreme values for Gaussian stochastic processes. By the generalized Pickands constant Hη we mean the limit Hη = lim T→∞ Hη(T ) T , where Hη(T ) = IE exp ( maxt∈[0,T ] (√ 2η(t)− σ2 η(t) )) and η(t) is a centered Gaussian process with stationary increments and variance function σ2 η(t). Under some mild conditions on σ2 η(t) we ...
متن کاملSome Remarks on Generalized Sequence Space of Bounded Variation of Sequences of Fuzzy Numbers
The idea of difference sequences of real (or complex) numbers was introducedby Ki zmaz cite{Kizmaz}. In this paper, using the difference operator and alacunary sequence, we introduce and examine the class of sequence $bv_{theta}left( Delta,mathcal{F}right) .$ We study some of its properties likesolidity, symmetricity, etc.
متن کاملEdge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملSOME REMARKS ON GENERALIZATIONS OF MULTIPLICATIVELY CLOSED SUBSETS
Let R be a commutative ring with identity and Mbe a unitary R-module. In this paper we generalize the conceptmultiplicatively closed subset of R and we study some propertiesof these genaralized subsets of M. Among the many results in thispaper, we generalize some well-known theorems about multiplicativelyclosed subsets of R to these generalized subsets of M. Alsowe show that some other well-kno...
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002